#Kevnatinian Algorithm
#8-17-13

def hunt_choices(round_number, current_food, current_reputation, m,  player_reputations):
	if round_number == 1:
		hunt_decisions = ['h' for x in player_reputations]
    	return hunt_decisions

	P = len(player_reputations) #How many player's left?
	num = m / P #How many hunts should each player do to get reward.
	
	hunts = 0
	slacks = 0
	choices = []
	for i in range(len(player_reputations)):
		if player_reputations[i] > 0.65:
			choices.append('h')
			hunts += 1
		if player_reputations[i] < 0.25:
			choices.append('s')
			slacks += 1
		else:
			choices.append('q')
	
	num -= hunts
	
	for i in range(len(player_reputations)):
		if choices[i] == 'q':
			if num > 0:
				choices[i] = 'h'
			else:
				choices[i] = 's'
	return choices
				
def hunt_outcomes(food_earnings):
	pass

def round_end(award, m, number_hunters):
	pass	
	
